PERFect: PERmutation Filtering test for microbiome data

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

permutation approach for adjusted durbin rank test used in balanced incomplete block designs for tied data

durbin's rank test is widely used for testing treatment effects in balanced incomplete block designs (bibds)which have wide applications in sensory analysis. this test is failed for bibds when ties data occur. an adjusted version of durbin rank test for this kind of data is given to solve this problem. chi-square approximation, which is commonly used for this test, is not adequate for small bib...

متن کامل

Multivariate permutation test to compare survival curves for matched data

BACKGROUND In the absence of randomization, the comparison of an experimental treatment with respect to the standard may be done based on a matched design. When there is a limited set of cases receiving the experimental treatment, matching of a proper set of controls in a non fixed proportion is convenient. METHODS In order to deal with the highly stratified survival data generated by multipl...

متن کامل

A Permutation Test for Matching

We consider a permutation method for testing whether observations given in their natural pairing exhibits an unusual level of similarity in situations where any two observations may be similar at some unknown baseline level. Under a null hypotheses where there is no distinguished pairing of the observations, a normal approximation, with explicit bounds and rates, is presented for determining ap...

متن کامل

A Randomness Test for Stable Data

In this paper, we propose a new method for checking randomness of non-Gaussian stable data based on a characterization result. This method is more sensitive with respect to non-random data compared to the well-known non-parametric randomness tests.

متن کامل

Fast Filtering Heuristics for Perfect Bipartite Matchings

The bipartite matching problem has wide applicability. For example, in computer science, researchers have applied bipartite matching in objection recognition, image processing, scheduling, genomics, term rewriting and formal verification, and computer security. We present a heuristic model of perfect matchings in bipartite graphs. The goal of the model is to explore the use of low-cost heuristi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Biostatistics

سال: 2018

ISSN: 1465-4644,1468-4357

DOI: 10.1093/biostatistics/kxy020